ProbVerus: Probabilistic Symbolic Model Checking
نویسندگان
چکیده
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checking allows one to verify properties that may not be true with probability one, but may still hold with an acceptable probability. The challenge in developing a probabilistic model checker able to handle realistic systems is the construction of the state space and the necessity to solve huge systems of linear equations. To address this problem, we have developed ProbVerus, a tool for the formal verification of probabilistic real-time systems. ProbVerus is an implementation of probabilistic computation tree logic (PCTL) model checking using symbolic techniques. We present ProbVerus, demonstrate its use with a simple manufacturing example, and report the current status of the tool. With ProbVerus, we have been able to analyze, within minutes, the safety logic of a railway interlocking controller with 1027 states.
منابع مشابه
SYMBOLIC IMPLEMENTATION OF MODEL - CHECKING PROBABILISTIC TIMED AUTOMATA by FUZHI WANG
In this thesis, we present symbolic implementation techniques for model checking probabilistic timed automata as models for systems, for example, communication networks and randomised distributed algorithms. Given a system model as probabilistic timed automata and a specification, such as, “a leader will be elected within 5 time units with probability 0.999” and “the message can be successfully...
متن کاملSymbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs and Simplex∗
Symbolic model checking for purely probabilistic processes using MTBDDs [12] was introduced in [4] and further developed in [20, 3]. In this paper we consider models for concurrent probabilistic systems similar to those of [28, 7, 5] and the concurrent Markov chains of [35, 13], which extend the purely probabilistic processes through the addition of nondeterministic choice. As a specification f...
متن کاملSymbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs and the Simplex Algorithm
Symbolic model checking for purely probabilistic processes using MTB-DDs 12] was introduced in 4] and further developed in 20, 3]. In this paper we consider models for concurrent probabilistic systems similar to those of 28, 7, 5] and the concurrent Markov chains of 35, 13], which extend the purely probabilistic processes through the addition of nondeterministic choice. As a speciication formal...
متن کاملImplementation of Symbolic Model Checking for Probabilistic Systems Progress Report 3 -thesis Proposal Thesis Group Members
In this report, we propose research to be carried out in the area of probabilistic symbolic model checking. Model checking is an automatable technique for the formal veri cation of nite state systems against speci cations given in a temporal logic. A great deal of work has gone into extending the model checking paradigm to the probabilistic setting. This allows veri cation techniques to be deve...
متن کاملSymbolic Model Checking for Factored Probabilistic Models
The long line of research in probabilistic model checking has resulted in efficient symbolic verification engines. Nevertheless, scalability is still a key concern. In this paper we ask two questions. First, can we lift, to the probabilistic world, successful hardware verification techniques that exploit local variable dependencies in the analyzed model? And second, will those techniques lead t...
متن کامل